Multi-objective Cooperative Coevolutionary Evolutionary Algorithms for Continuous and Combinatorial Optimization

نویسندگان

  • Bernabé Dorronsoro
  • Grégoire Danoy
  • Pascal Bouvry
  • Antonio J. Nebro
چکیده

This chapter introduces three new multi-objective cooperative coevolutionary variants of three state-of-the-art multi-objective evolutionary algorithms, namely, Nondominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary Algorithm 2 (SPEA2) and Multi-objective Cellular Genetic Algorithm (MOCell). In such a coevolutionary architecture, the population is split into several subpopulations, each of them being in charge of optimizing a subset of the global solution by using the original multi-objective algorithm. Evaluation of complete solutions is achieved through cooperation, i.e., all subpopulations share a subset of their current partial solutions. Our purpose is to study the performance of the coevolutionary multi-objective approaches in two different contexts: continuous and combinatorial optimization. In the first case we deal with a set of well-known benchmark problems, while in the the second one we conduct a study about a real-world problem related to grid computing, the bi-objective robust scheduling problem of independent tasks. The goal in this problem is to minimize makespan (i.e., the time when the latest machine finishes its assigned tasks) and to maximize the robustness of the schedule (i.e., its tolerance to unexpected changes on the estimated time to complete the tasks). We have made a parallel, multithreaded implementation of the coevolutionary algorithms and we have analyzed the results obtained in terms of both the quality of the Pareto front approximations yielded by the techniques as well as the resulting speedups when running them on a multicore machine. Bernabé Dorronsoro Interdisciplinary Centre for Security, Reliability, and Trust, University of Luxembourg, e-mail: [email protected] Grégoire Danoy and Pascal Bouvry Faculty of Sciences, Technology and Communication, University of Luxembourg e-mail: {gregoire.danoy, pascal.bouvry}@uni.lu Antonio J. Nebro E.T.S.I. Informática, University of Málaga, Spain e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Efficacy of Multi-objective Evolutionary Algorithms for Real-World Applications (Abstract of Invited Talk)

Multi-objective evolutionary algorithms (MOEAs) are a class of stochastic optimization techniques that simulate biological evolution to solve problems with multiple objectives. Multi-objective (MO) optimization is a challenging research topic because it involves the simultaneous optimization of several (and normally conflicting) objectives in the Pareto optimal sense. It requires researchers to...

متن کامل

Analyzing Cooperative Coevolution with Evolutionary Game Theory

The task of understanding coevolutionary algorithms is a very difficult one. These algorithms search landscapes which are in some sense adaptive. As a result, the dynamical behaviors of coevolutionary systems can frequently be even more complex than traditional evolutionary algorithms (EAs). Moreover, traditional EA theory tells us little about coevolutionary algorithms. One major question that...

متن کامل

Efficient Multi-Objective Optimization Using 2-Population Cooperative Coevolution

We propose a 2-population cooperative coevolutionary optimization method that can efficiently solve multi-objective optimization problems as it successfully combines positive traits from classic multi-objective evolutionary algorithms and from newer optimization approaches that explore the concept of differential evolution. A key part of the algorithm lies in the proposed dual fitness sharing m...

متن کامل

A Parallel Multi-Objective Cooperative Coevolutionary Algorithm for Optimising Small-World Properties in VANETs

Cooperative coevolutionary evolutionary algorithms differ from standard evolutionary algorithms’ architecture in that the population is split into subpopulations, each of them optimising only a sub-vector of the global solution vector. All subpopulations cooperate by broadcasting their local partial solutions such that each subpopulation can evaluate complete solutions. Cooperative coevolution ...

متن کامل

The Cooperative Coevolutionary (1+1) EA

Coevolutionary algorithms are variants of traditional evolutionary algorithms and are often considered more suitable for certain kinds of complex tasks than noncoevolutionary methods. One example is a general cooperative coevolutionary framework for function optimization. This paper presents a thorough and rigorous introductory analysis of the optimization potential of cooperative coevolution. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011